Continuous Region Query Processing in Clustered Point Sets
نویسندگان
چکیده
منابع مشابه
Continuous Query Processing and Dissemination
Traditional database information monitoring techniques, such as database triggers, active DBMS and continuous queries have various limitations, can not provide large scale dynamic data push and have no efficient data dissemination support. Meanwhile, current dissemination systems, which are separated from database, can not handle complicated query requests, such as aggregate operation. Also, as...
متن کاملEfficient Query Processing for Multi-Dimensionally Clustered Tables in DB2
We have introduced a Multi-Dimensional Clustering (MDC) physical layout scheme in DB2 version 8.0 for relational tables. MultiDimensional Clustering is based on the definition of one or more orthogonal clustering attributes (or expressions) of a table. The table is organized physically by associating records with similar values for the dimension attributes in a cluster. Each clustering key is a...
متن کاملContinuous Query Processing in Spatio-Temporal Databases
In this paper, we aim to develop a framework for continuous query processing in spatio-temporal databases. The proposed framework distinguishes itself from other query processors by employing two main paradigms: (1) Scalability in terms of the number of concurrent continuous spatio-temporal queries. (2) Incremental evaluation of continuous spatio-temporal queries. Scalability is achieved thorou...
متن کاملAdaptive Query Processing in Point-Transformation Schemes
Point-transformation schemes transform multidimensional points to one-dimensional values so that conventional access methods can be used to index multidimensional points, enabling convenient integration of multidimensional query facilities into complex transactional database management systems. However, in high-dimensional data spaces, the computational complexity of the required query transfor...
متن کاملAnalysis of approximate nearest neighbor searching with clustered point sets
Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these points into a data structure, so that given a query point, the nearest data point to the query point can be reported efficiently. Because data sets can be quite large, we are primarily interested in data structures that use only O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.08.040